Distributionally robust facility location problem under decision-dependent stochastic demand
نویسندگان
چکیده
While the traditional facility location problem considers exogenous demand, in some applications, locations of facilities could affect willingness customers to use certain types services, e.g., carsharing, and therefore they also realizations random demand. Moreover, a decision maker may not know exact distribution such endogenous demand how it is affected by choices. In this paper, we consider distributionally robust problem, which interpret moments stochastic as functions facility-location decisions. We reformulate two-stage decision-dependent optimization model monolithic formulation, then derive mixed-integer linear programming reformulation well valid inequalities when means variances are piecewise solutions. conduct extensive computational studies, compare our with deterministic model, models without assumption. The results show superior performance approach remarkable improvement profit quality service under various settings, addition speed-ups given formulation enhancements. These draw attention need considering impact decisions on customer within strategic-level planning problem.
منابع مشابه
Dynamic Facility Location with Stochastic Demand
Determination of facilities, such as factories or warehouses, location and availability conditions is one of the important and strategic decisions for an organization to make. Transportation costs that form a major part of goods price are dependent to this decision making. There are verity of methods have been presented to achieve the optimal locations of these facilities which are generally de...
متن کاملDistributionally Robust Stochastic Knapsack Problem
This paper considers a distributionally robust version of a quadratic knapsack problem. In this model, a subsets of items is selected to maximizes the total profit while requiring that a set of knapsack constraints be satisfied with high probability. In contrast to the stochastic programming version of this problem, we assume that only part of information on random data is known, i.e., the firs...
متن کاملDistributionally robust stochastic shortest path problem
This paper considers a stochastic version of the shortest path problem, the Distributionally Robust Stochastic Shortest Path Problem(DRSSPP) on directed graphs. In this model, the arc costs are deterministic, while each arc has a random delay. The mean vector and the second-moment matrix of the uncertain data are assumed known, but the exact information of the distribution is unknown. A penalty...
متن کاملCapacitated Facility Location With Distance-Dependent Coverage Under Demand Uncertainty
We consider a facility location problem to determine the points of dispensing medicine or supplies in a large-scale emergency. For this problem we consider capacitated facilities, a distance-dependent coverage function, and demand uncertainty. We formulate a special case of the maximal covering location problem (MCLP) with a loss function, to account for the distance-sensitive demand, and chanc...
متن کاملRobust uncapacitated multiple allocation hub location problem under demand uncertainty: minimization of cost deviations
The hub location–allocation problem under uncertainty is a real-world task arising in the areas such as public and freight transportation and telecommunication systems. In many applications, the demand is considered as inexact because of the forecasting inaccuracies or human’s unpredictability. This study addresses the robust uncapacitated multiple allocation hub location problem with a set of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2021
ISSN: ['1872-6860', '0377-2217']
DOI: https://doi.org/10.1016/j.ejor.2020.11.002